On the Mathematical Background of Gilbreath's Card Trick

نویسنده

  • Ehrhard Behrends
چکیده

In Martin Gardner's book \New mathematical diversions from Scientiic American" it is described how certain information concerning the initial distribution of a deck of cards survives an arbitrarily thorough riie shuue. This gives rise to a card trick which is attributed to Norman Gilbreath, several other tricks presented in magic journals are based on the same principle. Here we aim to generalize the underlying ideas. We consider sequences a 1 ; a 2 ;. .. with values in f?1; +1g for which the sequence a 1 ; a 1 +a 2 ;. .. of the associated partial sums only has small oscillations. It is indicated how general properties of such (a n) can be used to understand what happens when shuuing cards and how this can be given the form of a card trick. The mathematics involved is rather elementary.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds from a card trick

We describe a new variation of a mathematical card trick, whose analysis leads to new lower bounds for data compression and estimating the entropy of Markov sources.

متن کامل

The Kruskal Count

The Kruskal Count is a card trick invented by Martin Kruskal in which a magician “guesses” a card selected by a subject according to a certain counting procedure. With high probability the magician can correctly “guess” the card. The success of the trick is based on a mathematical principle related to coupling models for Markov chains. This paper analyzes in detail two simplified variants of th...

متن کامل

The Gilbreath Trick: A case study in Axiomatisation and Proof Development in the Coq Proof Assistant

We present the full axiomatisation and proof development of a non-trivial property of binary sequences, inspired from a card trick of N. Gilbreath. This case study illustrates the power and naturalness of the Calculus of Inductive Constructions as a specification language, and outlines a uniform methodology for conducting inductive proofs in the Coq proof assistant.

متن کامل

Mathematical Card Tricks

Trick: Deal 27 cards, face up onto a table in three columns with 9 cards in each. Ask your victim to choose a card but not to tell you what it is. Three times, ask in which column the card lies, and each time, collect the cards, putting the selected column between the cards in the other two columns, leaving the columns in order, and then deal the cards again by rows to make the next set of colu...

متن کامل

On the Complexity of Trick-Taking Card Games

Determining the complexity of perfect information trick-taking card games is a long standing open problem. This question is worth addressing not only because of the popularity of these games among human players, e.g., DOUBLE DUMMY BRIDGE, but also because of its practical importance as a building block in state-of-the-art playing engines for CONTRACT BRIDGE, SKAT, HEARTS, and SPADES. We define ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997